A Linear Time Algorithm for Absolute Optima under Monotonous Gain Functions on Trees
نویسنده
چکیده
We examine problems of placing facilities in a tree graph to serve customers. The decision of placement is driven by an election process amongst the users, where the user preference is modeled by distances in the tree. Relaxed user preferences introduce a tolerance of users against small di erences in distances. Monotonous gain functions are a natural generalization of well known competitive and voting location problems such as Simpson, security, Stackelberg and Nash. In this technical report we present an algorithm which computes an absolute solution, i.e., a point with minimum score for any monotonous gain function. The running time is linear in the size of the input tree and hence optimal.
منابع مشابه
Relaxed voting and competitive location on trees under monotonous gain functions
We examine problems of placing facilities in a tree graph to serve customers. The decision of placement is driven by an election process amongst the users, where the user preference is modeled by distances in the tree. Relaxed user preferences introduce a tolerance of users against small di erences in distances. Monotonous gain functions are introduced to provide general results of which well k...
متن کاملTabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach
The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملA Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
متن کاملOn stability of some lexicographic integer optimization problem
A lexicographic integer optimization problem with criteria represented by absolute values of linear functions is considered. Five types of stability for the set of lexicographic optima under small changes of the parameters of the vector criterion are investigated.
متن کامل